Cognate Identi cation and Phylogenetic Inference : Search for a Better Past

نویسندگان

  • Abhaya Agarwal
  • Jason Adams
چکیده

Historical linguistics studies the relationships between languages as they change over time. Occasionally, speakers of a language will split into separate groups for any number of reasons and become isolated from each other. When this happens, the language they shared begins to diverge. These divergences are typically phonological, syntactic, and semantic in nature. These changes in each child language occur in di erent but systematic ways. Studying this phenomenon is at the heart of diachronic linguistics. In this paper, we will examine the role of two main applications of computational methods to historical linguistics. The rst is the identi cation of cognates. Identifying cognates is the rst step in the comparative method, the primary technique used by historical linguists to determine the relatedness of languages. The second area is phylogenetic inference, a method of automatically reconstructing the genetic relationships between languages and language families. We will examine computational and statistical approaches to these topics that have been taken in the literature to present a picture of the state of the art, concluding each section with a discussion of the future work to be done in these areas. In Section 2, we provide background information on historical linguistics that will inform the rest of this paper. Cognate identi cation and phonetic similarity measures are discussed in Section 3. Cognate identi cation forms the basis for reconstructing the evolutionary history of languages. We will brie y discuss some early work on this problem in Section 4 and then go on to discuss more recent methods of phylogenetic inference in Section 5. Finally, we present our conclusions about the application of computational methods to historical linguistics in Section 6.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

SECURING INTERPRETABILITY OF FUZZY MODELS FOR MODELING NONLINEAR MIMO SYSTEMS USING A HYBRID OF EVOLUTIONARY ALGORITHMS

In this study, a Multi-Objective Genetic Algorithm (MOGA) is utilized to extract interpretable and compact fuzzy rule bases for modeling nonlinear Multi-input Multi-output (MIMO) systems. In the process of non- linear system identi cation, structure selection, parameter estimation, model performance and model validation are important objectives. Furthermore, se- curing low-level and high-level ...

متن کامل

Gap-weighted subsequences for automatic cognate identification and phylogenetic inference

In this paper, we describe the problem of cognate identification and its relation to phylogenetic inference. We introduce subsequence based features for discriminating cognates from non-cognates. We show that subsequence based features perform better than the state-of-the-art string similarity measures for the purpose of cognate identification. We use the cognate judgments for the purpose of ph...

متن کامل

Intraspeci c ITS Variability in the Kingdom Fungi as Expressed in the International Sequence Databases and Its Implications for Molecular Species Identi cation

The internal transcribed spacer (ITS) region of the nuclear ribosomal repeat unit is the most popular locus for species identi cation and subgeneric phylogenetic inference in sequence-based mycological research. The region is known to show certain variability even within species, although its intraspeci c variability is often held to be limited and clearly separated from interspeci c variabi...

متن کامل

Identication-Robust Subvector Inference

This paper introduces identi…cation-robust subvector tests and con…dence sets (CS’s) that have asymptotic size equal to their nominal size and are asymptotically e¢ cient under strong identi…cation. Hence, inference is as good asymptotically as standard methods under standard regularity conditions, but also is identi…cation robust. The results do not require special structure on the models unde...

متن کامل

Inductive Inference of Limiting Programs with Bounded Number of Mind Changes

We consider inductive inference of total recursive functions in the case, when produced hypotheses are allowed some nite number of times to change \their mind" about each value of identi able function. Such type of identi cation, which we call inductive inference of limiting programs with bounded number of mind changes, by its power lies somewhere between the traditional criteria of inductive i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007